Gallai-type theorems and domination parameters
نویسندگان
چکیده
منابع مشابه
Gallai-type theorems and domination parameters
Let 7(G) denote the minimum cardinality of a dominating set of a graph G = (V,E). A longstanding upper bound for 7(G) is attributed to Berge: For any graph G with n vertices and maximum degree A(G), 7(G) <~ n A(G). We eharacterise connected bipartite graphs which achieve this upper bound. For an arbitrary graph G we furnish two conditions which are necessary if 7(G) + A(G) = n and are sufficien...
متن کاملGallai Theorems Involving Domination Parameters
In 1959 Gallai [5] showed that the vertex independence number and the vertex covering number of a graph G = (V,E) sum to |V |. Over the last twenty years, many results similar to Gallai’s Theorem have been observed [3]. These theorems are referred to as “Gallai Theorems” and usually have the form: α+ β = n. Slater [17] described several graph subset parameters using linear programs (LP) and int...
متن کاملSylvester-Gallai type theorems for approximate collinearity
We study questions in incidence geometry where the precise position of points is ‘blurry’ (e.g. due to noise, inaccuracy or error). Thus lines are replaced by narrow tubes, and more generally affine subspaces are replaced by their small neighborhood. We show that the presence of a sufficiently large number of approximately collinear triples in a set of points in C implies that the points are cl...
متن کاملFractional Sylvester-Gallai Theorems∗
We prove fractional analogs of the classical Sylvester-Gallai theorem. Our theorems translate local information about collinear triples in a set of points into global bounds on the dimension of the set. Specifically, we show that if for every points v in a finite set V ⊂ C, there are at least δ|V | other points u ∈ V for which the line through v, u contains a third point in V , then V resides i...
متن کاملGallai colorings and domination in multipartite digraphs
Assume that D is a digraph without cyclic triangles and its vertices are partitioned into classes A1, . . . , At of independent vertices. A set U = ∪i∈SAi is called a dominating set of size |S| if for any vertex v ∈ ∪i/ ∈SAi there is a w ∈ U such that (w, v) ∈ E(D). Let β(D) be the cardinality of the largest independent set of D whose vertices are from different partite classes of D. Our main r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00231-8